Synthesis of Concurrent Programs Based on Supervisory Control

نویسندگان

  • Marian V. Iordache
  • Panos J. Antsaklis
چکیده

This document describes an application of the supervisory control (SC) methods to the synthesis of concurrent programs and presents current work on this topic of research. In particular, special attention is given to the development of software that applies SC to program synthesis. This work is motivated by the difficulties encountered in writing correct programs in the context of concurrency. Writing correct programs is essential for the development of software applications as well as for all other engineering applications in which formal languages are used for system design. In the context of concurrency, SC can be help by addressing issues such as mutual exclusion, liveness, and fairness. In the approach proposed here, SC is applied to Petri net (PN) models of concurrent processes. Then, the resulting control logic is converted to code. PNs are formal models developed in Computer Science for the modeling of concurrent systems. In Control Systems, PNs have been used in the context of the SC of discrete event systems and powerful theoretical results have been developed. However, these results have not yet been applied to Computer Science problems for which PNs were created. The main objective of this research work is to apply SC tools to the automatic synthesis of programming code based on a high-level program specification. The goal is to reduce the programming effort by having more of the higher level requirements implemented automatically. On one hand, the automatically generated code is correct by construction and on the other hand, the programmer has only to manage simpler high-level specifications.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conference on : Decision and Control , Dec . 1996 , Kobe , JapanOptimal Finite State Supervisory

Supervisory Controllers are Discrete Event Dynamic Systems (DEDSs) forming the discrete core of a Hybrid Control System. We address the problem of automatic synthesis of Optimal Finite State Supervisory Controllers (OSCs). We show that Boolean First Order Logic (BFOL) and Binary Decision Diagrams (BDDs) are an eeective meth-odological and practical framework for Optimal Finite State Supervisory...

متن کامل

Optimal Finite State Supervisory Control

Supervisory Controllers are Discrete Event Dynamic Systems (DEDSs) forming the discrete core of a Hybrid Control System. We address the problem of automatic synthesis of Optimal Finite State Supervisory Controllers (OSCs). We show that Boolean First Order Logic (BFOL) and Binary Decision Diagrams (BDDs) are an eeective meth-odological and practical framework for Optimal Finite State Supervisory...

متن کامل

Supervisory control of software execution for failure avoidance: Experience from the Gadara project

We discuss our experience in the Gadara project, whose objective is to control the execution of software to avoid potential failures using discrete-event control techniques. We summarize our accomplishments so far and discuss future challenges. After initial work on safety of workflow scripts via supervisory control techniques, we have focused our efforts on deadlock avoidance in multithreaded ...

متن کامل

A Learning-based Synthesis Approach to Decentralized Supervisory Control of Discrete Event Systems with Unknown Plants

In this paper, we consider the problem of automatic synthesis of decentralized supervisor synthesis for uncertain discrete event systems. In particular, we study the case when the uncontrolled plant is unknown a priori. To deal with the unknown plants, we first characterize the co-normality of prefixclosed regular languages and propose formulas for computing the supremal co-normal sublanguages;...

متن کامل

Supervisory control of heap models using synchronous composition

Heaps models are powerful models for concurrent timed discrete event systems. They admit linear description using dioid algebras. Inspired by supervisory control of logical discrete event systems we introduce parallel composition of heap models, called synchronous product, to formally describe the action of supervisor (represented by another heap model) on the system. This additional explicit c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009